منابع مشابه
Some Hermitian Dual Containing BCH Codes and New Quantum Codes
Let q = 3l+2 be a prime power. Maximal designed distances of imprimitive Hermitian dual containing q2-ary narrow-sense (NS) BCH codes of length n = (q 6−1) 3 and n = 3(q 2 −1)(q2 +q+1) are determined. For each given n, non-narrow-sense (NNS) BCH codes which achieve such maximal designed distances are presented, and a series of NS and NNS BCH codes are constructed and their parameters are comput...
متن کاملConstructions of new families of nonbinary asymmetric quantum BCH codes and subsystem BCH codes
Two code constructions generating new families of good nonbinary asymmetric quantum BCH codes and good nonbinary subsystem BCH codes are presented in this paper. The first one is derived from q-ary Steane’s enlargement of CSS codes applied to nonnarrow-sense BCH codes. The second one is derived from the method of defining sets of classical cyclic codes. The asymmetric quantum BCH codes and subs...
متن کاملQuantum Bch Codes
After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of errors. This error model—the quantum erasure channel—is discussed. Finally, parameters of quantum BCH codes are provided.
متن کاملConstruction and decoding of BCH Codes
BCfi wdes over arbitrary finite ~~~nirnut:!tiv~ rings with identity arc drip& in LCF~S of their locator vector, The derivation is hased on the factorization of .I-’ -I over the unit ring of an ~tppropr~lt~ extension of the finite rin g. We prcscnt an ~~~ci~nt,d~~iu~ procedure, based on the modified Berlekamp Massey ;li~~~rithrn. for that codes. The code construction and the decoding proccdurcs ...
متن کاملConstruction of digital nets from BCH-codes
We establish a link between the theory of error-correcting codes and the theory of (t, m, s)-nets. This leads to the fundamental problem of net embeddings of linear codes. Our main result is the construction of four infinite families of digital (t, m, s)-nets based on BCH-codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2851075